Quantum Computation, Categorical Semantics and Linear Logic
نویسندگان
چکیده
We develop a type theory and provide a denotational semantics for a simple fragment of the quantum lambda calculus, a formal language for quantum computation based on linear logic. In our semantics, variables inhabit certain Hilbert bundles, and computations are interpreted as the appropriate inner product preserving maps between Hilbert bundles. These bundles and maps form a symmetric monoidal closed category, as expected for a calculus based on linear logic.
منابع مشابه
Quantum Lambda Calculus
We discuss the design of a typed lambda calculus for quantum computation. After a brief discussion of the role of higher-order functions in quantum information theory, we define the quantum lambda calculus and its operational semantics. Safety invariants, such as the no-cloning property, are enforced by a static type system that is based on intuitionistic linear logic. We also describe a type i...
متن کاملTheory and Applications of Linear Dependent Types First Year Report, DPhil
This report outlines a proposed 2-year research programme towards the degree of Doctor of Philosophy, building on the exploratory research conducted by the author in the past year. We propose to pursue the following two related goals. A) Explaining the flow of information in dependent type theory; B) Generating and studying new models of type dependency motivated by various scientific disciplin...
متن کاملA functional quantum programming language
This thesis introduces the language QML, a functional language for quantumcomputations on finite types. QML exhibits quantum data and control structures,and integrates reversible and irreversible quantum computations.The design of QML is guided by the categorical semantics: QML programs are in-terpreted by morphisms in the category FQC of finite quantum computations, whichpr...
متن کاملQuantum Programming Languages: An Introductory Overview
ly. In Selinger, P. (ed.) Proc. 2nd Int. Workshop on Quantum Programming Languages, Turku, Finland, July 12– 13, pp. 57–73. Turku Centre for Computer Science. [45] Coecke, B. (2005) De-linearizing linearity: projective quantum axiomatics from strong compact closure. In Selinger, P. (ed.) Proc. 3rd Int. Workshop on Quantum Programming Languages, Chicago, USA, June 30 to July 1, pp. 43–63. Electr...
متن کاملA Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)
We give a categorical semantics for a call-by-value linear lambda calculus. Such a lambda calculus was used by Selinger and Valiron as the backbone of a functional programming language for quantum computation. One feature of this lambda calculus is its linear type system, which includes a duplicability operator “!” as in linear logic. Another main feature is its call-by-value reduction strategy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره quant-ph/0312174 شماره
صفحات -
تاریخ انتشار 2003